List decodability at small radii
نویسندگان
چکیده
A′(n,d,e), the smallest ` for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size ` up to radius e, is determined for all d ≥ 2e−3. As a result, A′(n,d,e) is determined for all e≤ 4, except for 42 values of n.
منابع مشابه
On the List Decodability of Self-orthogonal Rank Metric Codes
V. Guruswami and N. Resch prove that the list decodability of Fq-linear rank metric codes is as good as that of random rank metric codes in [17]. Due to the potential applications of self-orthogonal rank metric codes, we focus on list decoding of them. In this paper, we prove that with high probability, an Fq-linear self-orthogonal rank metric code over Fn×m q of rate R = (1 − τ)(1 − n mτ) − is...
متن کاملCombinatorial bounds for list decoding
Informally, an error-correcting code has “nice” listdecodability properties if every Hamming ball of “large” radius has a “small” number of codewords in it. Here, we report linear codes with non-trivial list-decodability: i.e., codes of large rate that are nicely listdecodable, and codes of large distance that are not nicely list-decodable. Specifically, on the positive side, we show that there...
متن کاملQuantum List Decoding of Classical Block Codes of Polynomially Small Rate from Quantumly Corrupted Codewords
Given a classical error-correcting block code, the task of quantum list decoding is to produce from any quantumly corrupted codeword a short list containing all messages whose codewords exhibit high “presence” in the quantumly corrupted codeword. Efficient quantum list decoders have been used to prove a quantum hardcore property of classical codes. However, the code rates of all known families ...
متن کاملOn the List-Decodability of Random Linear Rank-Metric Codes
The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an Fq-linear rank-metric code over F m×n q of rate R = (1 − ρ)(1 − n m ρ) − ε is shown to be (with high probability) list-decodable up to fractional radius ρ ∈ (0, 1) with lists of size at most Cρ,q ε , where Cρ,q is a constant depending only on ρ and q. This matches the bo...
متن کاملAverage-radius list-recovery of random linear codes: it really ties the room together
We analyze the list-decodability, and related notions, of random linear codes. This has been studied extensively before: there are many different parameter regimes and many different variants. Previous works have used complementary styles of arguments—which each work in their own parameter regimes but not in others—and moreover have left some gaps in our understanding of the list-decodability o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 61 شماره
صفحات -
تاریخ انتشار 2011